Novel Methods for Finding (generalized) Joinable Schedules
نویسندگان
چکیده
This paper is about novel methods for finding Joinable Schedules (JS) as defined by J. Somló and extended by E. K. Nagy. After a short introduction to JSs and their merits,generalization of JSs are introduced. This article deals with methods aimed to improve the efficiency of finding JSs. After introducing the methods and the underlying principles, the methods are analyzed and their results on the generated example set is visualized.
منابع مشابه
A New Way for Fms Lot Streaming: the Joinable Schedule Approach
Quality solution of scheduling is one of the key factors to make FMS profitability high. The scheduling problems may be solved by sophisticated operational research approaches and as well with simple heuristic methods. Having a solution for a scheduling problem it is a natural wish to improve it. On some stage, at the original formulation of the problems, these improvements become very difficul...
متن کاملIllustrating an Error in “an Equivalent Condition for a Uniform Space to Be Coverable”
Berestovskii and Plaut introduced the concept of a coverable space [1] when developing their theory of generalized universal covering maps for uniform spaces. If a space is coverable and chain connected then it has a generalized universal covering map. Brodskiy, Dydak, LaBuz, and Mitra introduced the concept of a uniformly joinable space [2] when developing a theory of generalized uniform cover...
متن کاملSIDF: A Novel Framework for Accurate Surgical Instrument Detection in Laparoscopic Video Frames
Background and Objectives: Identification of surgical instruments in laparoscopic video images has several biomedical applications. While several methods have been proposed for accurate detection of surgical instruments, the accuracy of these methods is still challenged high complexity of the laparoscopic video images. This paper introduces a Surgical Instrument Detection Framework (SIDF) for a...
متن کاملProving Ground Confluence of Equational Specifications Modulo Axioms
Terminating functional programs should be deterministic, i.e., should evaluate to a unique result, regardless of the evaluation order. For equational functional programs such determinism is exactly captured by the ground confluence property. For terminating equations this is equivalent to ground local confluence, which follows from local confluence. Checking local confluence by computing critic...
متن کاملUtilizing Generalized Learning Automata for Finding Optimal Policies in MMDPs
Multi agent Markov decision processes (MMDPs), as the generalization of Markov decision processes to the multi agent case, have long been used for modeling multi agent system and are used as a suitable framework for Multi agent Reinforcement Learning. In this paper, a generalized learning automata based algorithm for finding optimal policies in MMDP is proposed. In the proposed algorithm, MMDP ...
متن کامل